Computational complexity theory - PDFSEARCH.IO - Document Search Engine

Computational complexity theory
Results: 2049

#	Item
421	This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution and shar Add to Reading List Source URL: www-m6.ma.tum.de Language: English - Date: 2011-12-07 06:14:53 Numerical analysis Computational science Electromagnetic radiation Chemical engineering Monte Carlo method Probabilistic complexity theory Radiative transfer Heat transfer Algorithm Applied mathematics Mathematics Science
422	Microsoft Word - ReportingAboutDesignResearch.doc Add to Reading List Source URL: wwwhome.cs.utwente.nl Language: English - Date: 2007-02-19 06:08:07 Operations research Structural complexity theory Mathematical optimization Reduction Problem Epistemology Chess problem NP Knowledge Theoretical computer science Applied mathematics Computational complexity theory
423	Noname manuscript No. (will be inserted by the editor) Faster Randomized Consensus With an Oblivious Adversary James Aspnes Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2015-04-30 10:34:00 Analysis of algorithms Probabilistic complexity theory Consensus Randomized algorithm Time complexity SL Iterated logarithm Theoretical computer science Computational complexity theory Applied mathematics
424	Microsoft Word - D-wave August 14th Add to Reading List Source URL: www.kcpl.ca Language: English - Date: 2013-06-03 14:34:10 Quantum information science Physics D-Wave Systems Computational complexity theory Protein folding Quantum computer Lattice protein Protein design Quantum mechanics Protein structure Theoretical computer science Applied mathematics
425	Online Computation with Advice Yuval Emek1 ? , Pierre Fraigniaud2 ?? , Amos Korman2 Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2010-02-08 08:39:17 Computational complexity theory Applied mathematics Competitive analysis K-server problem Randomized algorithm Metrical task system Adversary model Minimum spanning tree Bin packing problem Theoretical computer science Online algorithms Analysis of algorithms
426	Chapter 1 Introduction Let f be Boolean function from nite binary strings to the set f0; 1g. The basic question of complexity theory is what computational resources are needed to compute f (x) for an arbitrary n-bit str Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2011-01-05 06:16:54 Circuit complexity Complexity classes Parity function ACC0 Switching lemma NC Clique problem Boolean circuit Circuit Theoretical computer science Computational complexity theory Applied mathematics
427	A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic Razvan Barbulescu1 , Pierrick Gaudry1 , Antoine Joux2,3 , and Emmanuel Thomé1 1 Add to Reading List Source URL: www.loria.fr Language: English - Date: 2013-12-16 04:03:37 Finite fields Group theory Logarithms Cryptography Computational complexity theory Time complexity Polynomial General number field sieve Field extension Abstract algebra Mathematics Algebra
428	Exercise 1 (A streaming algorithm for the second moment of the frequencies). We are given a stream of numbers x1 , . . . , xn ∈ {0, . . . , m − 1} and we want to compute the sum of the squares of the frequencies of Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2015-01-19 07:51:43 Probabilistic complexity theory Randomized algorithm Logarithm Applied mathematics Computational complexity theory Errors-in-variables models Normal distribution Theoretical computer science Mathematics Analysis of algorithms
429	Exercise 1 (Streaming algorithm for frequent items). We want to design a streaming algorithm that nds all the items in a stream of n items with frequency strictly greater than n/k for some xed k . Consider the followin Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2015-01-22 08:15:45 Streaming algorithm Theoretical computer science Computational complexity theory Graph coloring Mathematics Algorithms Applied mathematics
430	PHYSICAL REVIEW B 82, 104522 共2010兲 Analysis of a tunable coupler for superconducting phase qubits Ricardo A. Pinto and Alexander N. Korotkov* Department of Electrical Engineering, University of California, Riversid Add to Reading List Source URL: www.physast.uga.edu Language: English - Date: 2010-12-15 11:27:20 Models of computation Computational complexity theory Information theory Quantum computer Quantum cryptography Quantum gate Quantum circuit Relaxation Qubit Theoretical computer science Quantum information science Applied mathematics

UPDATE